منابع مشابه
Relational Constructions on Semiconcept Graphs
The aim of the paper is to develop a logic of relations on semiconcept graphs corresponding to the Contextual Logic of Relations on power context families. Semiconcept graphs allow the representation of negations. The operations from Peircean Algebraic Logic (i.e., the operations of relation algebras of power context families) are used to generate compound semiconcepts (or relations, resp.). Fo...
متن کاملPredicative degree constructions in Spanish1
This article explores adjectival degree constructions formed around the copular element de ‘of’ in Spanish such as un montón de listo (a load of smart, ‘considerably smart’), como tú de gordo (like you of fat, ‘as fat as you’), and así de alto (this of tall, ‘this tall’.) In these constructions, a predication relation takes place between the degree to which the property denoted by the adjective...
متن کاملDetecting Relational Constructions in German Texts Automatically
Löbner’s theory of concept types and determination (CTD) claims that nouns show different distributional fingerprints depending on their lexical determination class. In order to investigate this hypothesis, corpora annotated by determination patterns are needed (definiteness and relationality). In the paper, we focus on the harder of the two annotation tasks, the automatic detection of relation...
متن کاملDegree-degree correlations in directed networks with heavy-tailed degrees
In network theory, Pearson’s correlation coefficients are most commonly used to measure the degree assortativity of a network. We investigate the behavior of these coefficients in the setting of directed networks with heavy-tailed degree sequences. We prove that for graphs where the inand out-degree sequences satisfy a power law, Pearson’s correlation coefficients converge to a non-negative num...
متن کاملDegree-Degree Dependencies in Random Graphs with Heavy-Tailed Degrees
Mixing patterns in large self-organizing networks, such as the Internet, the World Wide Web, social, and biological networks are often characterized by degreedegree dependencies between neighboring nodes. In assortative networks, the degreedegree dependencies are positive (nodes with similar degrees tend to connect to each other), whereas in disassortative networks, these dependencies are negat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Semantics and Linguistic Theory
سال: 2018
ISSN: 2163-5951
DOI: 10.3765/salt.v27i0.4142